https://nova.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:9001 Wed 11 Apr 2018 16:34:19 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:40971 Thu 21 Jul 2022 08:45:23 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:16325 Sat 24 Mar 2018 07:58:03 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:23348 NP-hardness, research has focused on approximate methods like metaheuristics. Tabu Search (TS) is a very efficient metaheuristic for combinatorial problems. We investigate four different versions of TS with different tabu objects and compare them to the Lin-Kernighan (LK) heuristic as well as the recently developed Multi-Neighborhood Search (MNS). LK is currently considered to be the best approach for solving the TSP, while MNS has shown to be highly competitive. We then propose new hybrid algorithms by hybridizing TS with Evolutionary Algorithms and Ant Colony Optimization. These hybrids are compared to similar hybrids based on LK and MNS. This paper presents the first statistically sound and comprehensive comparison taking the entire optimization processes of (hybrid) TS, LK, and MNS into consideration based on a large-scale experimental study. We show that our new hybrid TS algorithms are highly efficient and comparable to the state-of-the-art algorithms along this line of research.]]> Sat 24 Mar 2018 07:13:33 AEDT ]]>